Approximate algorithms for unrelated machine scheduling to minimize makespan
نویسندگان
چکیده
منابع مشابه
Archived Simulated Annealing for Unrelated Parallel Machine Scheduling to Minimize Fuzzy Makespan and Tardiness
The research proposes a two-phase matching-based decoding scheme that will be incorporated into bi-objective simulated annealing (SA) to solve unrelated parallel machine scheduling problems (UPMSP). The two objectives are to maximize the satisfactions of makespan and average tardiness, in terms of fuzzy measure. The effectiveness of the decoding scheme is investigated using four simulated annea...
متن کاملEfficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
This paper discusses an efficient heuristic to minimize the makespan of scheduling n independent jobs on m unrelated parallel machines. The problem of scheduling the jobs on the unrelated parallel machines is combinatorial in nature. Hence, the heuristic approach is inevitable for quicker solution. In this paper, a simple and efficient heuristic is designed to minimize the makespan of schedulin...
متن کاملSingle-machine scheduling with periodic maintenance to minimize makespan
We consider a single-machine scheduling problem with periodic maintenance activities. Although the scheduling problem with maintenance has attracted researchers’ attention, most of past studies considered only one maintenance period. In this research several maintenance periods are considered where each maintenance activity is scheduled after a periodic time interval. The objective is to find a...
متن کاملSingle Machine Scheduling with Job Delivery to minimize makespan
In the single machine scheduling problem with job delivery to minimize makespan, jobs are processed on a single machine and delivered by a capacitated vehicle to their respective customers. We first consider the special case with a single customer, that is, all jobs have the same transportation time. Chang and Lee (2004) proved that this case is strongly NP-hard. They also provided a heuristic ...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2015
ISSN: 1547-5816
DOI: 10.3934/jimo.2016.12.771